Geospatial Resource Description Framework %28GRDF%29 and security constructs.

Ontology based policy interoperability in geo%2Dspatial domain.

Materializing Inferred and Uncertain Knowledge in RDF Datasets.

Materializing and Persisting Inferred and Uncertain Knowledge in RDF Datasets.

Multi%2Dlabel ASRS Dataset Classification Using Semi Supervised Subspace Clustering.

Classification and Novel Class Detection of Data Streams in a Dynamic Feature Space.

Data Stream Mining Challenges and Techniques.

Using Correlation Based Subspace Clustering for Multi%2Dlabel Text Data Classification.

Efficient RDF data management including provenance and uncertainty.

Efficient RDF data management including provenance and uncertainty.

Classification and Novel Class Detection in Data Streams with Active Mining.

Tweethood Agglomerative Clustering on Fuzzy k%2DClosest Friends with Variable Depth for Location Mining.

Relationalization of provenance data in complex RDF reification nodes.

Secure Data Objects Replication in Data Grid.
Abstract—Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical information. To achieve performance goals in data accesses, these data fragmentation approaches can be combined with dynamic replication. In this paper, we consider data partitioning (both secret sharing and erasure coding) and dynamic replication in data grids, in which security and data access performance are critical issues. More specifically, we investigate the problem of optimal allocation of sensitive data objects that are partitioned by using secret sharing scheme or erasure coding scheme and/or replicated. The grid topology we consider consists of two layers. In the upper layer, multiple clusters form a network topology that can be represented by a general graph. The topology within each cluster is represented by a tree graph. We decompose the share replica allocation problem into two subproblems: the Optimal Intercluster Resident Set Problem (OIRSP) that determines which clusters need share replicas and the Optimal Intracluster Share Allocation Problem (OISAP) that determines the number of share replicas needed in a cluster and their placements. We develop two heuristic algorithms for the two subproblems. Experimental studies show that the heuristic algorithms achieve good performance in reducing communication cost and are close to optimal solutions. Index Terms—Secure data, secret sharing, erasure coding, replication, data grids. Ç 1
Analysis of firewall policy rules using traffic mining techniques.

Cause Identification from Aviation Safety Incident Reports via Weakly Supervised Semantic Lexicon Construction.

Knowledge Based Image Annotation Refinement.

Storage and Retrieval of Large RDF Graph Using Hadoop and MapReduce.

Integrating Novel Class Detection with Classification for Concept%2DDrifting Data Streams.

Geographically%2Dtyped semantic schema matching.

Real%2DTime Knowledge Discovery and Dissemination for Intelligence Analysis.
This paper describes the issues and challenges for real-time knowledge discovery and then discusses approaches and challenges for real-time data mining and stream mining. Our goal is to extract accurate information to support the emergency responder, the war fighter, as well as the intelligence analyst in a timely manner. 
SISC A Text Classification Approach Using Semi Supervised Subspace Clustering.

Semantic Schema Matching without Shared Instances.

R2D A Bridge between the Semantic Web and Relational Visualization Tools.

RDFKB efficient support for RDF inference queries and knowledge management.

A Relational Wrapper for RDF Reification.

Design and implementation of a secure social network system.

Assured Information Sharing Life Cycle.

Lacking Labels in the Stream Classifying Evolving Stream Data with Few Labels.

Design of a temporal geosocial semantic web for military stabilization and reconstruction operations.

Building a Geosocial Semantic Web for Military Stabilization and Reconstruction Operations.

A Multi%2Dpartition Multi%2Dchunk Ensemble Technique to Classify Concept%2DDrifting Data Streams.

Relationalizing RDF stores for tools reusability.

R2D Extracting Relational Structure from RDF Stores.

Exploiting an antivirus interface.

R2d a Framework for the Relational Transformation of RDF Data.

Privacy%2FAnalysis Tradeoffs in Sharing Anonymized Packet Traces Single%2DField Case.

Data Mining for Security Applications.
 
Making Quantitative Measurements of Privacy%2FAnalysis Tradeoffs Inherent to Packet Trace Anonymization.

Content%2Dbased ontology matching for GIS datasets.

Ontology based policy interoperability in geo%2Dspatial domain.

A Practical Approach to Classify Evolving Data Streams Training with Limited Amount of Labeled Data.

Detecting Remote Exploits Using Data Mining.

A Novel Quantitative Approach For Measuring Network Security.
Abstract—Evaluation of network security is an essential step in securing any network. This evaluation can help security professionals in making optimal decisions about how to design security countermeasures, to choose between alternative security architectures, and to systematically modify security configurations in order to improve security. However, the security of a network depends on a number of dynamically changing factors such as emergence of new vulnerabilities and threats, policy structure and network traffic. Identifying, quantifying and validating these factors using security metrics is a major challenge in this area. In this paper, we propose a novel security metric framework that identifies and quantifies objectively the most significant security risk factors, which include existing vulnerabilities, historical trend of vulnerability of the remotely accessible services, prediction of potential vulnerabilities for any general network service and their estimated severity and finally policy resistance to attack propagation within the network. We then describe our rigorous validation experiments using reallife vulnerability data of the past 6 years from National Vulnerability Database (NVD) [10] to show the high accuracy and confidence of the proposed metrics. Some previous works have considered vulnerabilities using code analysis. However, as far as we know, this is the first work to study and analyze these metrics for network security evaluation using publicly available vulnerability information and security policy configuration. 1 I.
Ontology Alignment Using Multiple Contexts.

The SCRUB security data sharing infrastructure.

Towards autonomic risk%2Daware security configuration.
Abstract—Security of a network depends on a number of dynamically changing factors. These include emergence of new vulnerabilities and threats, policy structure and network traffic. Due to the dynamic nature of these factors, identifying security metrics that measure objectively the quality of security configuration pose a major challenge. Moreover, this evaluation must be done dynamically to handle real time changes in the threat toward the network. In this paper, we extend our security metric framework [2] that identifies and quantifies objectively the most significant security risk factors, which include existing vulnerabilities, historical trend of vulnerabilities of remotely accessible services, prediction of potential vulnerabilities for any general network service and their estimated severity and finally propagation of an attack within the network. We have implemented this framework as a user-friendly tool called Risk based prOactive seCurity cOnfiguration maNAger (ROCONA) and showed how this tool simplifies security configuration management using risk measurement and mitigation. I.
Measuring anonymization privacy%2Fanalysis tradeoffs inherent to sharing network data.

Software Fault Localization Using N%2Dgram Analysis.

Multi%2Dconcept Document Classification Using a Perceptron%2DLike Algorithm.

An Effective Evidence Theory Based K%2DNearest Neighbor %28KNN%29 Classification.

Geospatial Semantic Web%2C Definition.

Privacy and Security Challenges in GIS.

Managing and Mining Multimedia Data%2C Animations and Annotations.

Emergency Response Applications Dynamic Plume Modeling and Real%2DTime Routing.

Multi%2Dlabel large margin hierarchical perceptron.

A scalable multi%2Dlevel feature extraction technique to detect malicious executables.

Multimedia Data Mining and Knowledge Discovery.
In this paper, we present the  plication of the general scheme of  Knowledge Discovery to Multimedia  data. In particular, we discuss the  extraction of structures from video  news. Concrete results are pre-  sented for the extraction of knowl-  edge based on color properties (of  characteristic video images) using  fuzzy decision tree based method. Keywords: Multimedia mining,  Video, Fuzzy decision trees.
Predicting WWW surfing using multiple evidence combination.

Geospatial data qualities as web services performance metrics.

DAGIS A Geospatial Semantic Web Services Discovery and Selection Framework.

A Hybrid Model to Detect Malicious Executables.

Geospatial Data Mining for National Security Land Cover Classification and Semantic Grouping.

Feature Based Techniques for Auto%2DDetection of Novel Email Worms.

Constructing gene co%2Dexpression networks and predicting functions of unknown genes by random matrix theory.

Toward Trusted Sharing of Network Packet Traces Using Anonymization Single%2DField Privacy%2FAnalysis Tradeoffs

Standards for secure data sharing across organizations.

Standards for image annotation using Semantic Web.
The impetus behind Semantic Web research remains the vision of supplementing availability with utility; that is, the World Wide Web provides availability of digital media, but the Semantic Web will allow presently available digital media to be used in unseen ways. An example of such an application is multimedia retrieval. At present, there are vast amounts of digital media available on the web. Once this media gets associated with machine-understandable metadata, the web can serve as a potentially unlimited supplier for multimedia web services, which could populate themselves by searching for keywords and subsequently retrieving images or articles, which is precisely the type of system that is proposed in this paper. Such a system requires solid interoperability, a central ontology, semantic agent search capabilities, and standards. Specifically, this paper explores this cross-section of image annotation and Semantic Web services, models the web service components that constitute such a system, discusses the sequential, cooperative execution of these Semantic Web services, and introduces intelligent storage of image semantics as part of a semantic link space.
Web Navigation Prediction Using Multiple Evidence Combination and Domain Knowledge.

A framework for a video analysis tool for suspicious event detection.
This paper proposes a framework to aid video analysts in detecting suspicious activity within the tremendous amounts of video data that exists in today’s world of omnipresent surveillance video. Ideas and techniques for closing the semantic gap between low-level machine readable features of video data and high-level events seen by a human observer are discussed. An evaluation of the event classification and diction technique is presented and future an experiment to refine this technique is proposed. These experiments are used as a lead to a discussion on the most optimal machine learning algorithm to learn the event representation scheme proposed in this paper. 1.
Rapid goal%2Doriented automated software testing using MEA%2Dgraph planning.

A new intrusion detection system using support vector machines and hierarchical clustering.
ABSTRACT: An intrusion detection system plays a major role in network security. We propose a model “DB-OLS: An Approach for IDS ” which is a Deviation Based-Outlier approach for Intrusion detection using Self Organizing Maps. In this model “Self Organizing Map ” approach is to be used for behavior learning and “Outlier mining” approach, for detecting an intruder by calculating deviation from known user profile. This model aims to improve the capability of detecting intruders.
Detection and Resolution of Anomalies in Firewall Policy Rules.

Analysis of Firewall Policy Rules Using Data Mining Techniques.
 Firewall is the de facto core technology of today&#039;s network security. However, the management of firewall rules has been proven to be complex, error-prone, costly and inefficient for many large-networked organizations. To make firewall policy rules useful and effective, a timely and thorough analysis of network traffic data is often required in a perpetual or periodic timeframe. This is often economically infeasible or operationally impractical due to the magnitude of data, the complexity of analysis, and its resource requirement. In this paper, we present a set of techniques and algorithms to analyze and manage firewall policy rules with (1) Data Mining techniques to deduce firewall policy rules by mining its network traffic log with Association Rule Mining (ARM) and Mining firewall Log using Frequency (MLF), (2) Filtering-Rule Generalization (FRG) by generalization and Clustering Algorithm by Gap Analysis (CAGA) to cluster IP addresses or Port numbers, (3) the detection of various anomalies based on the mining exposes many hidden but not detectable by analyzing only the firewall policy rules, and (4) a technique to identify decaying rule and dominant rule, thus in result to generate a new set of efficient firewall policy rules.  
Email Worm Detection Using Na%EFve Bayes and Support Vector Machine.

Analysis of Firewall Policy Rules Using Data Mining Techniques.
 Firewall is the de facto core technology of today&#039;s network security. However, the management of firewall rules has been proven to be complex, error-prone, costly and inefficient for many large-networked organizations. To make firewall policy rules useful and effective, a timely and thorough analysis of network traffic data is often required in a perpetual or periodic timeframe. This is often economically infeasible or operationally impractical due to the magnitude of data, the complexity of analysis, and its resource requirement. In this paper, we present a set of techniques and algorithms to analyze and manage firewall policy rules with (1) Data Mining techniques to deduce firewall policy rules by mining its network traffic log with Association Rule Mining (ARM) and Mining firewall Log using Frequency (MLF), (2) Filtering-Rule Generalization (FRG) by generalization and Clustering Algorithm by Gap Analysis (CAGA) to cluster IP addresses or Port numbers, (3) the detection of various anomalies based on the mining exposes many hidden but not detectable by analyzing only the firewall policy rules, and (4) a technique to identify decaying rule and dominant rule, thus in result to generate a new set of efficient firewall policy rules.  
Vulnerability analysis For evaluating quality of protection of security policies.
 = (ADKh+H j.
Access control%2C confidentiality and privacy for video surveillance databases.

Reasoning with semantics%2Daware access control policies for geospatial web services.

Secure knowledge management confidentiality%2C trust%2C and privacy.
Abstract—Knowledge management enhances the value of a corporation by identifying the assets and expertise as well as efficiently managing the resources. Security for knowledge management is critical as organizations have to protect their intellectual assets. Therefore, only authorized individuals must be permitted to execute various operations and functions in an organization. In this paper, secure knowledge management will be discussed, focusing on confidentiality, trust, and privacy. In particular, certain access-control techniques will be investigated, and trust management as well as privacy control for knowledge management will be explored. Index Terms—Data mining, privacy, role-based access control (RBAC), secure knowledge management, security policy, semantic web, trust negotiation (TN), usage control (UCON). I.
A Repository for Component%2Dbased Embedded Software Development.

Introduction.
The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating e ects found in other languages, such as global state, exception handling, output, or non-determinism. Three case studies are looked at in detail: how monads ease the modi cation of a simple evaluator; how monads act as the basis of a datatype of arrays subject to in-place update; and how monads can be used to build parsers.  
Real%2Dtime classification of variable length multi%2Dattribute motions.

Automatic image annotation and retrieval using weighted feature selection.
Abstract. The development of technology generates huge amounts of non-textual information, such as images. An efficient image annotation and retrieval system is highly desired. Clustering algorithms make it possible to represent visual features of images with finite symbols. Based on this, many statistical models, which analyze correspondence between visual features and words and discover hidden semantics, have been published. These models improve the annotation and retrieval of large image databases. However, image data usually have a large number of dimensions. Traditional clustering algorithms assign equal weights to these dimensions, and become confounded in the process of dealing with these dimensions. In this paper, we propose weighted feature selection algorithm as a solution to this problem. For a given cluster, we determine relevant features based on histogram analysis and assign greater weight to relevant features as compared to less relevant features. We have implemented various different models to link visual tokens with keywords based on the clustering results of K-means algorithm with weighted feature selection and without feature selection, and evaluated performance using precision, recall and correspondence accuracy using benchmark dataset. The results show that weighted feature selection is better than traditional ones for automatic image annotation and retrieval.
Dependable Real%2DTime Data Mining.
In this paper we discuss the need for real-time data mining for many applications in government and industry and describe resulting research issues. We also discuss dependability issues including incorporating security, integrity, timeliness and fault tolerance into data mining. Several different data mining outcomes are described with regard to their implementation in a real-time environment. These outcomes include clustering, association-rule mining, link analysis and anomaly detection. The paper describes how they would be used together in various parallel-processing architectures. Stream mining is discussed with respect to the challenges of performing data mining on stream data from sensors. The paper concludes with a summary and discussion of directions in this emerging area. 1.
Image annotations by combining multiple evidence %26 wordNet.

Dependable Real%2DTime Data Mining.
In this paper we discuss the need for real-time data mining for many applications in government and industry and describe resulting research issues. We also discuss dependability issues including incorporating security, integrity, timeliness and fault tolerance into data mining. Several different data mining outcomes are described with regard to their implementation in a real-time environment. These outcomes include clustering, association-rule mining, link analysis and anomaly detection. The paper describes how they would be used together in various parallel-processing architectures. Stream mining is discussed with respect to the challenges of performing data mining on stream data from sensors. The paper concludes with a summary and discussion of directions in this emerging area. 1.
Improving Image Annotations Using WordNet.

Translating Images to Keywords Problems%2C Applications and Progress.

Hierarchical Clustering for Complex Data.

A Framework for Effective Annotation of Information from Closed Captions Using Ontologies.

A study of the model and algorithms for handling location%2Ddependent continuous queries.
A study of the model and algorithms for handling location-dependent continuous queries
The 6th international workshop on Multimedia Data Mining %28MDM%2FKDD2005%29.

Automated Test Data Generation Using MEA%2DGraph Planning.

An Effective Support Vector Machines %28SVMs%29 Performance Using Hierarchical Clustering.

Automatic image annotation and retrieval using subspace clustering algorithm.

A dynamically growing self%2Dorganizing tree %28DGSOT%29 for hierarchical clustering gene expression profiles.

The 4th international workshop on multimedia data mining %28MDM%2FKDD2003%29.

The 5th international workshop on multimedia data mining %28MDM%2FKDD2004%29.

Retrieval effectiveness of an ontology%2Dbased model for information selection.
Technology in the field of digital media generates huge amounts of non-textual information, audio, video, and images, along with more familiar textual information. The potential for exchange and retrieval of information is vast and daunting. The key problem in achieving efficient and userfriendly retrieval is the development of a search mechanism to guarantee delivery of minimal irrelevant information (high precision) while insuring relevant information is not overlooked (high recall). The traditional solution employs keyword-based search. The only documents retrieved are
Hierarchical Clustering of Gene Expression Data.

A Run%2DTime Based Technique to Optimize Queries in Distributed Internet Databases.

Effective Management of Location Dependent Continuous Queries in Mobile Environment.

Image Classification Using Neural Networks and Ontologies.
The advent of extremely powerful home PCs and the growth of the Internet have made the appearance of multimedia documents a common sight in the computer world. In the world of unstructured data composed of images and other media types, classification often comes at the price of countless hours of manual labor. This research aims to present a scalable system capable of examining images and accurately classifying the image based on its visual content. When retrieving images based on a user&#039;s query, the system will yields a minimal amount of irrelevant information (high precision) and insure a maximum amount of relevant information (high recall).
Ontology Construction for Information Selection.

A Comparative Study of Storing XML Data in Relational Database Management Systems.

Object Boundary Detection For Ontology%2DBased Image Classification.

Automatic Ontology Derivation Using Clustering for Image Classification.
Technology in the field of digital media generates huge amounts of non-textual information, audio, video, and images, along with more familiar textual information. The potential for exchange and retrieval of information is vast and daunting. The key problem in achieving efficient and user-friendly retrieval in the domain of image is the development of a search mechanism to guarantee delivery of minimal irrelevant information (high precision) while insuring that relevant information is not overlooked (high recall). The traditional solution to the problem of image retrieval employs contentbased search techniques based on color, texture or shape features. The traditional solution works well in performing searches in which the user specifies images containing a sample object, or a sample textural pattern, in which the object or pattern is indexed. One can overcome this restriction by indexing images according to meanings rather than objects that appear in images, although this will entail a way of converting objects to meanings. We have solved this problem of creating a meaning based index structure through the design and implementation of a concept-based model using domain dependent ontologies. An ontology is a collection of concepts and their interrelationships which provide an abstract view of an application domain. With regard to converting objects to meaning the key issue is to identify appropriate concepts that both describe and identify images. We propose a new mechanism that can generate ontologies automatically in order to make our approach scalable. To achieve this we propose a method for the automatic construction of ontologies based on clustering and a vector space model. Similarity of images is based on similarity of objects that appear in images. For object similarity measure, we consider the combination of color and shape similarity together. 1.
Object Detection for Hierarchical Image Classification.

A Component%2DBased Approach for Embedded Software Development.

An On%2DLine Repository for Embedded Software.

A performance evaluation of storing XML data in relational database management systems.

An Adaptive Probe%2DBased Technique to Optimize Join Queries in Distributed Internet Databases.
An adaptive probe-based optimization technique is developed and demonstrated in the context of an Internet-based distributed database environment. More and more common are database systems which are distributed across servers communicating via the Internet where a query at a given site might require data from remote sites. Optimizing the response time of such queries is a challenging task due to the unpredictability of server performance and network tra c at the time of data shipment � this may result in the selection of an expensive query plan using a static query optimizer. We constructed an experimental setup consisting of two servers running the same DBMS connected via the Internet. Concentrating on join queries, we demonstrate how a static query optimizer might choose an expensive plan by mistake. This is due to the lack of a priori knowledge of the run-time environment, inaccurate statistical assumptions in size estimation, and neglecting the cost of remote method invocation. These shortcomings are addressed collectively by proposing a probing mechanism. Furthermore, we extend our mechanism with an adaptive technique that detects sub-optimality of a plan during query execution and attempts to switch tothecheapest plan while avoiding redundant work and imposing little overhead. An implementation of our run-time optimization technique for join queries was constructed in the Java language and incorporated into an experimental setup. The results demonstrate the superiority of our probe-based optimization over a static optimization. 1
Audio Structuring and Personalized Retrieval Using Ontologies.

Effective Retrieval of Audio Information from Annotated Text Using Ontologies.
To improve the accuracy in terms of precision and recall of an audio information retrieval system we have created a domainspecific ontology (a collection of key concepts and their interrelationships), as well as a novel, pruning algorithm. Taking into account the shortcomings of keyword-based techniques, we have opted to employ a concept-based technique utilizing this ontology. The key problem in the retrieval of audio information is to achieve high precision and high recall. Typically, in traditional approaches, high recall is achieved at the expense of low precision, and vice versa. Through the use of a domain-specific ontology appropriate concepts can be identified during metadata generation (description of audio) or query generation, thus improving precision. In case of the association of irrelevant concepts to queries or documents there is a loss of precision. On the other hand, if relevant concepts are discarded, a loss of recall will ensue. Therefore, in conjunction with the use of a domain specific ontology we have proposed a novel, automatic pruning algorithm which prunes as many irrelevant concepts as possible during any case of query generation. By associating concepts in the ontology through techniques of correlation, this algorithm presents a method for the selection of concepts in the query generation. To improve recall, controlled and correct query expansion mechanism is proposed. This guarantees that precision will not be lost. Moreover, we present a way for the query generation in which domain-specific ontology can be used to generate information selection requests in terms of database queries in SQL. In trial implementations we have demonstrated that our ontology-based model outperforms keyword-based technique (vector space model) in terms of precision and recall.
A Probe%2DBased Technique to Optimize Join Queries in Distributed Internet Databases.

Structuring and querying personalized audio using ontologies.

